Partially observable stochastic game-based multi-agent prediction markets
نویسندگان
چکیده
We present a novel representation of the prediction market using a partially observable stochastic game with information (POSGI), that can be used by each trading agent to precisely calculate the state of the market. We then propose that a correlated equilibrium (CE) strategy can be used by the agents to dynamically calculate the prices at which they should trade securities in the prediction market. Simulation results comparing the CE strategy within our POSGI model with five other strategies commonly used in similar markets show that the CE strategy results in improved price predictions and higher utilities to the agents as compared to other strategies.
منابع مشابه
A reinforcement learning scheme for a multi-agent card game
We formulate an automatic strategy acquisition problem for the multi-agent card game “Hearts” as a reinforcement learning (RL) problem. Since there are often a lot of unobservable cards in this game, RL is approximately dealt with in the framework of a partially observable Markov decision process (POMDP). This article presents a POMDP-RL method based on estimation of unobservable state variable...
متن کاملMarkov Games of Incomplete Information for Multi-Agent Reinforcement Learning
Partially observable stochastic games (POSGs) are an attractive model for many multi-agent domains, but are computationally extremely difficult to solve. We present a new model, Markov games of incomplete information (MGII) which imposes a mild restriction on POSGs while overcoming their primary computational bottleneck. Finally we show how to convert a MGII into a continuous but bounded fully ...
متن کاملGame-Theoretic Agent Programming in Golog Under Partial Observability
In this paper, we present the agent programming language POGTGolog, which is a combination of explicit agent programming in Golog with game-theoretic multi-agent planning in a special kind of partially observable stochastic games (POSGs). It is a generalization of the agent programming language GTGolog by partial observability. The approach allows for partially specifying a high-level control p...
متن کاملStochastic Constraint Programming for General Game Playing with Imperfect Information
The game description language with incomplete information (GDL-II) is expressive enough to capture partially observable stochastic multi-agent games. Unfortunately, such expressiveness does not come without a price: the problem of finding a winning strategy is NEXPNP-hard, a complexity class which is far beyond the reach of modern constraint solvers. In this paper, we identify a PSPACE-complete...
متن کاملThe Dynamics of Multi-Agent Reinforcement Learning
Infinite-horizon multi-agent control processes with nondeterminism and partial state knowledge have particularly interesting properties with respect to adaptive control, such as the non-existence of Nash Equilibria (NE) or non-strict NE which are nonetheless points of convergence. The identification of reinforcement learning (RL) algorithms that are robust, accurate and efficient when applied t...
متن کامل